Ad hoc location service for mobile agents

In this paper, we study two implementations of a mobile agent location service in the context of an underlying ad hoc network. More precisely, this service aims at solving the problem of routing an agent toward a target agent in order to cooperate on a common host. Both the migration number and the tracking time must be minimized by such a service. We compare two implementations based on rumor propagation using either a piggybacking approach or a gossipy agent-based approach. The comparison of the two implementations is based on simulation results. Performance analysis demonstrates that the piggybacking approach minimizes the response time and the gossipy agent-based approach minimizes the network overhead.